Dyck tableaux
نویسندگان
چکیده
The starting point of this work is the discovery of a new and direct construction that relies bijectively the permutations of length n to some weighted Dyck paths named subdivided Laguerre histories. These objects correspond to the combinatorial interpretation of the development of the generating function for factorial numbers in terms of a Stieltjes continued fraction [9]. Such a bijection has been given by de Medicis and Viennot [5] but their construction is indirect in the sense that it decomposes a permutation in two involutions, then goes through the construction and the fusion of two Hermite histories. Another interest of our construction is that it gives a link between subdivided Laguerre histories and tree-like tableaux [1], which are a new presentation of permutation tableaux [8] or alternative tableaux [10]. The link lies in the insertion algorithm used on both classes of objects and whose key ingredient is the notion of ribbon. For this reason, the central objects of this paper are tableaux called Dyck tableaux whose natural reading in terms of words gives subdivided Laguerre histories. Although the original construction is not recursive, we are able to easily describe relevant statistics (generalized patterns, shape, (RL/LR)-(minima/maxima)) because of the recursive structure given by the insertion procedure. When talking about relevant statistics, we have in mind the long-term challenging motivation of this work: build new objects in order to give a new, and if possible simpler,
منابع مشابه
Cyclic sieving of increasing tableaux and small Schröder paths
An increasing tableau is a semistandard tableau with strictly increasing rows and columns. It is well known that the Catalan numbers enumerate both rectangular standard Young tableaux of two rows and also Dyck paths. We generalize this to a bijection between rectangular 2-row increasing tableaux and small Schröder paths. Using the jeu de taquin for increasing tableaux of [Thomas–Yong ’09], we t...
متن کاملPairs of noncrossing free Dyck paths and noncrossing partitions
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n + 1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.
متن کاملGenerating Functions for Inverted Semistandard Young Tableaux and Generalized Ballot Numbers
An inverted semistandard Young tableau is a row-standard tableau along with a collection of inversion pairs that quantify how far the tableau is from being column semistandard. Such a tableau with precisely k inversion pairs is said to be a k-inverted semistandard Young tableau. Building upon earlier work by Fresse and the author, this paper develops generating functions for the numbers of kinv...
متن کاملHook Formulas for Skew Shapes
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over excited diagrams of products of hook-lengths. We give an algebraic and a combinatorial proof of Naruse’s formula, by using factorial Schur functio...
متن کاملHomomesy of Alignments in Perfect Matchings
We investigate the existence of a group action τ that is homomesic with respect to alignments, a type of statistic in perfect matchings. Homomesy is defined as the consistency of an average, and perfect matchings are defined as the set of all partitions of 1 to 2n into pairs. We take advantage of the bijection between labeled Dyck paths and perfect matchings to investigate to investigate the po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 502 شماره
صفحات -
تاریخ انتشار 2013